An Effective Lower Bound for Group Complexity of Finite Semigroups and Automata
نویسنده
چکیده
The question of computing the group complexity of finite semigroups and automata was first posed in K. Krohn and J. Rhodes, Complexity of finite semigroups, Annals of Mathematics (2) 88 (1968), 128–160, motivated by the Prime Decomposition Theorem of K. Krohn and J. Rhodes, Algebraic theory of machines, I: Prime decomposition theorem for finite semigroups and machines, Transactions of the American Mathematical Society 116 (1965), 450–464. Here we provide an effective lower bound for group complexity.
منابع مشابه
Reduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملBearing Capacity of Strip Footings near Slopes Using Lower Bound Limit Analysis
Stability of foundations near slopes is one of the important and complicated problems in geotechnical engineering, which has been investigated by various methods such as limit equilibrium, limit analysis, slip-line, finite element and discrete element. The complexity of this problem is resulted from the combination of two probable failures: foundation failure and overall slope failure. The curr...
متن کاملGroups and Semigroups Defined by Colorings of Synchronizing Automata
In this paper we combine the algebraic properties of Mealy machines generating self-similar groups and the combinatorial properties of the corresponding deterministic finite automata (DFA). In particular, we relate bounded automata to finitely generated synchronizing automata and characterize finite automata groups in terms of nilpotency of the corresponding DFA. Moreover, we present a decidabl...
متن کاملLower Bounds on Words Separation: Are There Short Identities in Transformation Semigroups?
The words separation problem, originally formulated by Goralcik and Koubek (1986), is stated as follows. Let Sep(n) be the minimum number such that for any two words of length 6 n there is a deterministic finite automaton with Sep(n) states, accepting exactly one of them. The problem is to find the asymptotics of the function Sep. This problem is inverse to finding the asymptotics of the length...
متن کاملGraph Isomorphism is PSPACE-complete
Combining the the results of A.R. Meyer and L.J. Stockmeyer " The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space " , and K.S. Booth " Iso-morphism testing for graphs, semigroups, and finite automata are polynomiamlly equivalent problems " shows that graph isomorphism is PSPACE-complete. The equivalence problem for regular expressions was shown to be PSPACE-...
متن کامل